max-flow min-cut
英 [mæks fləʊ mɪn kʌt]
美 [mæks floʊ mɪn kʌt]
网络 最大流最小割
双语例句
- The famous max-flow min-cut theorem determines the maximum throughput of a network.
最大流最小割定理决定了网络的最大吞吐量。 - Network coding is a new method by which a multicast network can achieve the network capacity determined by the max-flow and min-cut theorem.
网络编码是一种全新的概念，组播网络中应用网络编码可以得到由最小割最大流理论确定的网络容量。 - Study shows network coding can increase the network throughput, and achieve the upper bound which is determined by the Max-flow Min-cut theorem.
通过网络编码，可以充分的利用网络的信道通信容量，达到由最小割最大流定理所确定的最大流上界。 - The proposed algorithm combines the color and motion information of the pixels to establish the energy function and construct the graph. Then the algorithm minimizes the energy function using the max-flow/ min-cut method and therefore achieves multiple objects tracking.
该算法结合像素的颜色信息和运动信息建立能量方程，构建网络图，利用最大流/最小割理论实现能量方程最小化，从而完成对多目标的跟踪。